class Solution {
public:
    vector<int> rowAndMaximumOnes(vector<vector<int>>& mat)
    {
        int index = INT_MAX, cnt = INT_MIN;
        for (int i = 0; i < mat.size(); i++)
        {
            int x = count(mat[i].begin(), mat[i].end(), 1);
            if (x > cnt)
            {
                index = i;
                cnt = x;
            }
        }
        return { index,cnt };
    }
};